Universal Leaky Random Oracle
نویسندگان
چکیده
Yoneyama et al. introduces the Leaky Random Oracle Model at ProvSec2008 to capture the leakages from the hash list of a hash function used by a cryptography construction due to various attacks caused by sloppy usages or implementations in the real world. However, an important fact is that such attacks would leak not only the hash list, but also other secret states (e.g. the secret key) outside the hash list. Therefore, the Leaky Random Oracle Model is very limited in the sense that it considers the leakages from the hash list alone, instead of taking into consideration other possible leakages from secret states simultaneously. In this paper, we present an augmented model of the Leaky Random Oracle Model. In our new model, both the secret key and the hash list can be leaked. Furthermore, the secret key can be leaked continually during the whole lifecycle of the cryptography construction. Hence, our new model is more universal and stronger than the Leaky Random Oracle Model and some other leakage models (e.g. only computation leaks model and memory leakage model). As an application example, we also present a public key encryption scheme which is provably IND-CCA secure in our new model.
منابع مشابه
Universal Leaky Random Oracle Model
K. Yoneyama et al. introduces the Leaky Random Oracle Model at ProvSec2008, which only considers the leakage of the hash list of a hash function used by a cryptosystem due to various attacks caused by implementation or sloppy usages. However, an important fact is that such attacks not only leak the hash list of a hash function, but also leak other secret states outside the hash list of a crypto...
متن کاملHow to Prove the Security of Practical Cryptosystems with Merkle-Damgård Hashing by Adopting Indifferentiability
In this paper, we show that major cryptosystems such as FDH, OAEP, and RSA-KEM are secure under a hash function MD with Merkle-Damg̊ard (MD) construction that uses a random oracle compression function h. First, we propose two new ideal primitives called Traceable Random Oracle (T RO) and Extension Attack Simulatable Random Oracle (ERO) which are weaker than a random oracle (RO). Second, we show ...
متن کاملA secure instantiation of the random oracle by a computable function
In this paper we investigate the problem of secure instantiation of the random oracle, based on the concepts and methods of algorithmic randomness. We show that, for any secure signature scheme in the random oracle model, there exists a specific computable function which can instantiate the random oracle while keeping the security originally proved in the random oracle model. Our results use th...
متن کامل3 Switching Lemma
Why do we care about random oracles? It goes back to computability theory. Many results including halting problems, R vs RE, and etc., were based on black-box simulations and the existence of universal machine. This includes clever methods such as diagonalization. People thought that the same technique would work for complexity theory, for example, P versus NP problem. An oracle machine is a Tu...
متن کاملPractical Secure Function Evaluation
This thesis focuses on the practical aspects of general two-party Secure Function Evaluation (SFE). A new SFE protocol that allows free evaluation of XOR gates and is provably secure against semi-honest adversaries in the random oracle model is given. Furthermore, the extension of SFE to private functions (PF-SFE) using universal circuits is considered. Based on a new practical universal circui...
متن کامل